package com.sgg.datastructure.tree;

public class BinaryTree {
    private HeroNode root;

    public void setRoot(HeroNode root) {
        this.root = root;
    }

    //前序遍历
    public void preOrder() {
        if (this.root != null) {
            this.root.preOrder();
        } else {
            System.out.println("二叉树为空，无法遍历");
        }
    }

    //中序遍历
    public void infixOrder() {
        if (this.root != null) {
            this.root.infixOrder();
        } else {
            System.out.println("二叉树为空，无法遍历");
        }
    }

    //后序遍历
    public void postOrder() {
        if (this.root != null) {
            this.root.postOrder();
        } else {
            System.out.println("二叉树为空，无法遍历");
        }
    }

    public HeroNode searchByPre(int no) {
        return this.root.searchByPre(no);
    }


    public HeroNode searchByMiddle(int no) {
        return this.root.searchByMiddle(no);

    }

    public HeroNode searchByPost(int no) {
        return this.root.searchByPost(no);
    }

    public void delete(int no) {
        this.root.delete(no);
    }


    public static void main(String[] args) {
//先需要创建一颗二叉树
        BinaryTree binaryTree = new BinaryTree();
//创建需要的结点
        HeroNode root = new HeroNode(1, "宋江");
        HeroNode node2 = new HeroNode(2, "吴用");
        HeroNode node3 = new HeroNode(3, "卢俊义");
        HeroNode node4 = new HeroNode(4, "林冲");
        HeroNode node5 = new HeroNode(5, "关胜");
//说明，我们先手动创建该二叉树，后面我们学习递归的方式创建二叉树
        root.setLeft(node2);
        root.setRight(node3);
        node3.setRight(node4);
        node3.setLeft(node5);
        binaryTree.setRoot(root);
//测试
        System.out.println("前序遍历"); // 1,2,3,5,4
        binaryTree.preOrder();
//测试
        System.out.println("中序遍历");
        binaryTree.infixOrder(); // 2,1,5,3,4
//
        System.out.println("后序遍历");
        binaryTree.postOrder(); // 2,5,4,3,1

        System.out.println("前序查找"+binaryTree.searchByPre(5));
        System.out.println("中序查找"+binaryTree.searchByMiddle(5));
        System.out.println("后序查找"+binaryTree.searchByPost(5));

        binaryTree.delete(1);
        System.out.println("删除");
        binaryTree.preOrder();

    }

}
